Park Search Edit Table

Park searches are defined for dynamic resources through the Park Search edit table shown next. If several resources share the same path network, each resource must have its own park search defined (i.e., resources cannot share park searches).

The fields of the Park Search edit table are defined as follows:

Node The node for which the park search is defined.

Parking Node List A list of nodes to which a resource may be sent to park. The resource will look for available capacity at the first node in the list (Node capacity is defined in the Path Networks edit table in the Nodes window). If there is no capacity at that node, the resource will look to the second node in the list and so on until a node with capacity is found. If no capacity is found at any node in the list, the resource will remain where it is until capacity becomes available at one of the nodes in the list.

In the table above, a park search has been defined for each of the internal path nodes where a forklift might deliver an entity and then be in the way if it has nothing else to do. Specifically, if a forklift makes a delivery and then becomes available at node N3, it will park at node N4. From node N5 it will park at node N1, and from node N6 it will park at node N7.